The braid-permutation group

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Permutation Representations of The Braid Group

We give a new infinite family of group homomorphisms from the braid group Bk to the symmetric group Smk for all k and m ≥ 2. Most known permutation representations of braids are included in this family. We prove that the homomorphisms in this family are non-cyclic and transitive. For any divisor l of m, 1 ≤ l < m, we prove in particular that if m l is odd then there are 1+ m l non-conjugate hom...

متن کامل

Universal Representations of Braid and Braid-permutation Groups

Drinfel’d used associators to construct families of universal representations of braid groups. We consider semi-associators (i.e., we drop the pentagonal axiom and impose a normalization in degree one). We show that the process may be reversed, to obtain semi-associators from universal representations of 3–braids. We view braid groups as subgroups of braid-permutation groups. We construct a fam...

متن کامل

The Braid Group of Z

We define quasi-Garside groups and prove a theorem about them parallel to Garside’s result on the word problem for the usual braid groups. We introduce a group which we call the braid group B of Zn, and which bears some resemblance to mapping class groups. We prove that B is a quasi-Garside group. We give a ‘small presentation’ for B.

متن کامل

Braid Group Cryptography

In the last decade, a number of public key cryptosystems based on combinatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them. This survey includes: Basic facts on braid groups and on the Garside normal form of its elements, some known algorithms for solving the word problem in the braid group, the major public-key cryp...

متن کامل

QUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology

سال: 1997

ISSN: 0040-9383

DOI: 10.1016/0040-9383(95)00072-0